Robust optimization models for the discrete time/cost trade-off problem
نویسندگان
چکیده
منابع مشابه
A Hybrid Method Based on Fuzzy AHP and VIKOR for the Discrete Time-Cost-Quality Trade-off Problem
Time, cost and quality are considered as the main components in managing each project. Previous researches have mainly focused on the time-cost trade-off problems. Recently quality is considered as the most important factor in project�s success, which is influenced by time acceleration that is the less time is spent the more success is gained. In time-cost-quality trade-off problems, each act...
متن کاملMINLP optimization model for the nonlinear discrete time-cost trade-off problem
This paper presents the mixed-integer nonlinear programming (MINLP) optimization model for the nonlinear discrete time–cost trade-off problem (NDTCTP). The nonlinear total project cost objective function of the proposed MINLP optimization model is subjected to a rigorous system of generalized precedence relationship constraints between project activities, project duration constraints, logical c...
متن کاملPareto Oriented Optimization of Discrete Time-cost Trade-off Problem Using Particle Swarm Optimization
In project scheduling, it is feasible to reduce the duration of a project by allocating additional resources to its activities. However, crashing the project schedule will impose additional costs. Numerous research has focused on optimizing the trade-off between time and cost to achieve a set of non-dominated solutions. However, the majority of the research on time-cost trade-off problem develo...
متن کاملMulti Objective Particle Swarm Optimization for a Discrete Time, Cost and Quality Trade -off Problem
Time -Cost trade-off is a known and important problem in project management, because project managers should decide that whether they want to shorten the time of a project and tolerate its execution costs or minimize the costs and accept delays. It was recently suggested that the quality of a project should also be taken into considerations in this decision-making. In this paper, a meta-heurist...
متن کاملAlgorithm robust for the bicriteria discrete optimization problem
Multiple vector optimization proposes to optimize a vector-valued function rather than a real-valued one. The motivation of that is quite natural, since most of the real-life problems involve more than one measure to be used as objective function. Multiple objective discrete optimization (MODO) problem is defined as minx∈X f(x) = [f1(x), . . . fp(x)] T , where X ⊆ R is a bounded (discrete) set ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Production Economics
سال: 2011
ISSN: 0925-5273
DOI: 10.1016/j.ijpe.2010.11.018